Data Type Inference for Logic Programming

In this paper we present a new static data type inference algorithm for logic programming. Without the need declaring types predicates, our is able to automatically assign predicates which, in most cases, correspond processed by their intended meaning. The also infer given definitions similar Haskell and, case, inferred are more informative, general. We algorithm, prove it decidable and sound with respect system, finally, evaluate approach on example programs that deal different structures.